Derivation of Diagonally Implicit Block Backward Differentiation Formulas for Solving Stiff Initial Value Problems

Diagonally Implicit Super Class of Block Backward Differentiation Formula with Off‐Step Points for Solving Stiff Initial Value Problems

A new formula called 2-point diagonally implicit super class of BBDF with two off-step points (2ODISBBDF) for solving stiff IVPs is formulated. The method approximates two solutions with two off-step points simultaneously at each iteration. By varying a parameter ρ ∈ (–1,1) in the formula, different sets of formulae can be generated. A specific choice of 3 4 ρ = is made and it was shown that th...

Fully Implicit 3-Point Block Extended Backward Differentiation Formula for Stiff Initial Value Problems

A new block extended backward differentiation formula suitable for the integration of stiff initial value problems is derived. The procedure used involves the use of an extra future point which helps in improving the performance of an existing block backward differentiation formula. The method approximates the solution at 3 points simultaneously at each step. Accuracy and stability properties o...

A new variable step size block backward differentiation formula for solving stiff initial value problems

Diagonally Implicit Block Backward Differentiation Formulas for Solving Ordinary Differential Equations

This paper focuses on the derivation of diagonally implicit two-point block backward differentiation formulas DI2BBDF for solving first-order initial value problem IVP with two fixed points. The method approximates the solution at two points simultaneously. The implementation and the stability of the proposed method are also discussed. A performance of the DI2BBDF is compared with the existing ...

An automatic multistep method for solving stiff initial value problems

A multistep method with matricial coefficients is developed. It can be used to solve stiff initial value problems of the form y’= Ay + g(x,y). This method bears the nature of the classical Adams-Bashforth-Moulton PC formula and can be shown to be consistent, convergent and A-stable. A careful reformulation of this method legitimatizes the implementation of this algorithm in a variable-step vari...